Hyperharmonic integers exist
نویسندگان
چکیده
We show that there exist infinitely many hyperharmonic integers, and this refutes a conjecture of Mező. In particular, for r=64·(2 α -1)+32, the number h 33 (r) is integer 153 different values α(mod748440), where smallest r equal to 64·(2 2659 -1)+32.
منابع مشابه
Nearly hyperharmonic functions and Jensen measures
Let (X,H) be a P-harmonic space and assume for simplicity that constants are harmonic. Given a numerical function φ on X which is locally lower bounded, let Jφ(x) := sup{ ∫ ∗ φdμ(x) : μ ∈ Jx(X)}, x ∈ X, where Jx(X) denotes the set of all Jensen measures μ for x, that is, μ is a compactly supported measure on X satisfying ∫ u dμ ≤ u(x) for every hyperharmonic function on X. The main purpose of t...
متن کاملA symmetric algorithm for hyperharmonic and Fibonacci numbers
In this work, we introduce a symmetric algorithm obtained by the recurrence relation an = a k n−1+a k−1 n . We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacciand Lucas numbers. An explicit formulae for hyperharmonic numbers, general generating functions of the Fibonacciand Lucas numbers are obtained. Besides we define ”hyperfibonacci numbers”, ”hy...
متن کاملWavelet Transforms That Map Integers to Integers
Invertible wavelet transforms that map integers to integers have important applications in lossless coding. In this paper we present two approaches to build integer to integer wavelet transforms. The first approach is to adapt the precoder of Laroia et al., which is used in information transmission; we combine it with expansion factors for the high and low pass band in subband filtering. The se...
متن کاملFibonacci Integers
A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77 = 21 · 55/(3 · 5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(log x) − (log x)) and e...
متن کاملEuler's Integers
Eulers integers are less known than the classic Eulerian numbers, though, in figurate form, they appear since antiquity.* First, we shall look at their origin and find their general expression; then we shall establish some of their properties and give various combinatoric applications. Several results may not have been published previously. The notation of periodic numbers and the notion of ari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2021
ISSN: ['1631-073X', '1778-3569']
DOI: https://doi.org/10.5802/crmath.137